<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
    <title>Search Algorithms: CPC-Stable</title>
    <meta content="text/html; charset=iso-8859-1"
          http-equiv="Content-Type">
</head>
<body>
<table bgcolor="maroon" border="1" width="95%">
    <tbody>
    <tr>
        <td><h2><font color="#ffffff">Search Algorithms: CPC-Stable </font></h2></td>
    </tr>
    </tbody>
</table>
<p><font color="#000000"><b></b></font><br>
<p>The CPC-Stable algorithm (add references) modifies CPC (see) in the same way that
    PC-Stable modifies PC. The adjacency search is modified so for depth i > 0, the
    graph obtained for for depth i is used to judge adjacencies for nodes. As a result,
    for instance, it is readily parallelizable, since the independence judgments within
    each depth are independent of each other. Also, it has been shown to reduce error
    for large searches.
</p>
</body>
</html>
